The Set of 2-by-3 Matrix Pencils - Kronecker Structures and Their Transitions under Perturbations
نویسندگان
چکیده
The set (or family) of 2-by-3 matrix pencils A ? B comprises 18 structurally diierent Kronecker structures (canonical forms). The algebraic and geometric characteristics of the generic and the 17 non-generic cases are examined in full detail. The complete closure hierarchy of the orbits of all diierent Kronecker structures is derived and presented in a closure graph that show how the structures relate to each other in the 12-dimensional space spanned by the set of 2-by-3 pencils. Necessary conditions on perturbations for transiting from the orbit of one Kronecker structure to another in the closure hierarchy are presented in a labeled closure graph. The node and arc labels show geometric characteristics of an orbit's Kronecker structure and the change of geometric characteristics when transiting to an adjacent node, respectively. Computable normwise bounds for the smallest perturbations (A; B) of a generic 2-by-3 pencil A?B such that (A+A)? (B +B) has a speciic non-generic Kronecker structure are presented. First explicit expressions for the perturbations that transfer A ? B to a speciied non-generic form are derived. In this context tractable and intractable perturbations are deened. Secondly, a modiied GUPTRI that computes a speciied Kronecker structure of a generic pencil is used. Perturbations devised to impose a certain non-generic structure is computed in a way that guarantees to nd a KCF on the closure of the orbit of the intended KCF. Both approaches are illustrated by computational experiments. Moreover, a study of the behaviour of the non-generic structures under random perturbations in nite precision arithmetic (using the GUPTRI software) show for which sizes of perturbations the structures are invariant and also that structure transitions occur in accordance with the closure hierarchy. Finally, some of the results are extended to the general m-by-(m + 1) case.
منابع مشابه
Computation and presentation of graphs displaying closure hierarchies of Jordan and Kronecker structures
StratiGraph, a Java-based tool for computation and presentation of closure hierarchies of Jordan and Kronecker structures is presented. The tool is based on recent theoretical results on strati=cations of orbits and bundles of matrices and matrix pencils. A strati=cation reveals the complete hierarchy of nearby structures, information critical for explaining the qualitative behaviour of linear ...
متن کاملBounds for the Distance between Nearby Jordan and Kronecker Structures in a Closure Hierarchy Dedicated to Vera N. Kublanovskaya on Her 80th Birthday
Computing the ne canonical-structure elements of matrices and matrix pencils are ill-posed problems. Therefore, besides knowing the canonical structure of a matrix or a matrix pencil, it is equally important to know what are the nearby canonical structures that explain the behavior under small perturbations. Qualitative strata information is provided by our StratiGraphtool. Here, we present low...
متن کاملNumerical Linear Algebra With
SUMMARY StratiGraph, a Java-based tool for computation and presentation of closure hierarchies of Jordan and Kronecker structures is presented. The tool is based on recent theoretical results on stratiications of orbits and bundles of matrices and matrix pencils. A stratiication reveals the complete hierarchy of nearby structures, information critical for explaining the qualitative behavior of ...
متن کاملEstimating the Sensitivity of the Algebraic Structure of Pencils with Simple Eigenvalue Estimates
The sensitivity of the algebraic (Kronecker) structure of rectangular matrix pencils to perturbations in the coefficients is examined. Eigenvalue perturbation bounds in the spirit of Bauer–Fike are used to develop computational upper and lower bounds on the distance from a given pencil to one with a qualitatively different Kronecker structure.
متن کاملStructured Backward Error Analysis of Linearized Structured Polynomial Eigenvalue Problems
We start by introducing a new class of structured matrix polynomials, namely, the class of MA-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-)palindromic, and alternating matrix polynomials. Then, we introduce the families of MAstructured strong block minima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 17 شماره
صفحات -
تاریخ انتشار 1996